A fast converging sampling operator

نویسندگان

چکیده

We construct a sampling operator with the property that smoother function is, faster its approximation is. establish direct estimate and weak converse of rate in uniform norm by means modulus smoothness $K$-functional. The case weighted is also considered. weights are positive power-type non-positive exponents at infinity. This preserves every algebraic polynomial.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Designing fast converging phylogenetic methods

Absolute fast converging phylogenetic reconstruction methods are provably guaranteed to recover the true tree with high probability from sequences that grow only polynomially in the number of leaves, once the edge lengths are bounded arbitrarily from above and below. Only a few methods have been determined to be absolute fast converging; these have all been developed in just the last few years,...

متن کامل

designing a fast locking pll

a phase-locked loop (pll) based frequency synthesizer is an important circuit that is used in many applications, especially in communication systems such as ethernet receivers, disk drive read/write channels, digital mobile receivers, high-speed memory interfaces, system clock recovery and wireless communication system. other than requiring good signal purity such as low phase noise and low spu...

Operator Identification and Sampling

Time–invariant communication channels are usually modelled as convolution with a fixed impulse–response function. As the name suggests, such a channel is completely determined by its action on a unit impulse. Time–varying communication channels are modelled as pseudodifferential operators or superpositions of time and frequency shifts. The function or distribution weighting those time and frequ...

متن کامل

Fast Converging Layered Adaptive Beam Forming Algorithm

LMS algorithm is simple and is well suited for continuous transmission systems since it is a continuously adaptive algorithm. However, it is not known for its convergence speed in the presence of Gaussian, spatially white, of null mean and variance which has prompted people to use other complicated algorithms. In the above scenario LMS has maximum mean square error and minimum error stability. ...

متن کامل

A Fast Converging Algorithm for Landau's Output-error Method

In this paper an approach to on-line ARMA parameter estimation based on a pseudo-linear regression and a QR matrix decomposition is developed. The algorithm has proven to be stable and has fast convergence properties if the unknown ARMA model satisses the strictly positive real condition. The derivation of the algorithm is straightforward and the computational complexity is O(N 2), however, fas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Constructive mathematical analysis

سال: 2022

ISSN: ['2651-2939']

DOI: https://doi.org/10.33205/cma.1172005